On recursive operations over logic LTS
نویسندگان
چکیده
منابع مشابه
On Recursive Operations Over Logic LTS
Recently, in order to mix algebraic and logic styles of specification in a uniform framework, the notion of a logic labelled transition system (Logic LTS or LLTS for short) has been introduced and explored. A variety of constructors over LLTS, including usual process-algebraic operators, logic connectives (conjunction and disjunction) and standard temporal operators (always and unless), have be...
متن کاملRecursive and computable operations over topological structures
concrete high-level language assembler language closure schemes Turing machines recursive operations computable operations Figure 1.1: Abstract versus concrete models given by the μ–recursive functions which have been developed by Herbrand, Gödel, Kleene and others [Kle36]. In the past, several different generalizations of recursive closure schemes in abstract settings have been suggested and i...
متن کاملSafe Reasoning with Logic LTS
Previous work has introduced the setting of Logic LTS, to-gether with a variant of ready simulation as fully-abstract refinementpreorder, which allows one to compose operational specifications using aCSP-style parallel operator as well as the propositional connectives con-junction and disjunction. In this paper, we show how a temporal logicfor specifying safety properties ma...
متن کاملMorphological Operations in Recursive Neighbourhoods
This paper discusses the use of recursive neighbourhoods in mathematical morphology. Its two notable applications are the recursive erosion/dilation, as well as the detection of foreground–background changes to be used in skeletonization. The benefit of the latter over the use of sub-cycles or an extension of the neighbourhood is emphasized. Two applications are presented that use the recursive...
متن کاملProcess Algebra with Recursive Operations
3 Axiomatisation of the Binary Kleene Star 15 3.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2 Completeness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3 Irredundancy of the Axioms . . . . . . . . . . . . . . . . . . . . . . . 24 3.4 Negative Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 3.5 Extensions of BPA∗(A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2014
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129514000073